Limit shape of random convex polygonal lines on Z: Even more universality
نویسنده
چکیده
The paper is concerned with the limit shape (under some probability measure) of convex polygonal lines on Z+ starting at the origin and with the right endpoint n = (n1, n2) → ∞. In the case of the uniform measure, the explicit limit shape γ∗ was found independently by Vershik, Bárány and Sinai. Bogachev and Zarbaliev recently showed that the limit shape γ∗ is universal in a certain class of measures analogous to multisets in the theory of decomposable combinatorial structures. In the present work, we extend the universality result to a much wider class of measures, including (but not limited to) analogues of multisets, selections and assemblies. This result is in sharp contrast with the one-dimensional case, where the limit shape of Young diagrams associated with integer partitions heavily depends on the distributional type.
منابع مشابه
Energy-Level Statistics of Model Quantum Systems: Universality and Scaling in a Lattice-Point Problem
We investigate the statistics of the number N(R, S) of lattice points, n E Z-', in an annular domain /7(R, w) = (R + w)A\RA, where R, w > 0. Here A is a fixed convex set with smooth boundary and w is chosen so that the area of/7(R, w) is S. The statistics comes from R being taken as random (with a smooth density) in some interval [c~ T, c, T], c2 > ct > 0. We find that in the limit T--* oo the ...
متن کاملInvalidity of Decoupling a Biharmonic Equation to Two Poisson Equations on Non-convex Polygons
We clarify the validity of a method that decouples a boundary value problem of biharmonic equation to two Poisson equations on polygonal domains. The method provides a way of computing deflections of simply supported polygonal plates by using Poisson solvers. We show that such decoupling is not valid if the polygonal domain is not convex. It may fail even when the right hand side function is in...
متن کاملBeta-Shape Using Delaunay-Based Triangle Erosion
The aim of this paper is to offer a faster and more rigorous way for calculating the Beta-Shape. The Beta-Shape is a tight-fitting concave polygonal contour, similar to the Alpha Shape, but which remains connected when data points are farther away than the desired resolution. The proposed method uses a computational geometry approach. We also propose an improvement to the original Beta Shape, a...
متن کاملUniversality of Critical Behaviour in a Class of Recurrent Random Walks
Let X0 = 0, X1, X2, . . . be an aperiodic random walk generated by a sequence ξ1, ξ2, . . . of i.i.d. integer-valued random variables with common distribution p (·) having zero mean and finite variance. For an N -step trajectory X = (X0, X1, . . . , XN ) and a monotone convex function V : R → R with V (0) = 0, define V(X) = PN−1 j=1 V ` |Xj | ́ . Further, let I N,+ be the set of all non-negative...
متن کامل